iHDG: An Iterative HDG Framework for Partial Differential Equations

نویسندگان

  • Sriramkrishnan Muralikrishnan
  • Minh-Binh Tran
  • Tan Bui-Thanh
چکیده

We present a scalable iterative solver for high-order hybridized discontinuous Galerkin (HDG) discretizations of linear partial differential equations. It is an interplay between domain decomposition methods and HDG discretizations, and hence inheriting advances from both sides. In particular, the method can be viewed as a Gauss-Seidel approach that requires only independent element-by-element and face-by-face local solves in each iteration. As such, it is well-suited for current and future computing systems with massive concurrencies. Unlike conventional Gauss-Seidel schemes which are purely algebraic, the convergence of iHDG, thanks to the built-in HDG numerical flux, does not depend on the ordering of unknowns. We rigorously show the convergence of the proposed method for the transport equation, the linearized shallow water equation and the convectiondiffusion equation. For the transport equation, the method is convergent regardless of mesh size h and solution order p, and furthermore the convergence rate is independent of the solution order. For the linearized shallow water and the convection-diffusion equations we show that the convergence is conditional on both h and p. Extensive steady and time-dependent numerical results for the 2D and 3D transport equations, the linearized shallow water equation, and the convection-diffusion equation are presented to verify the theoretical findings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

eHDG: An Exponentially Convergent Iterative Solver for HDG Discretizations of Hyperbolic Partial Differential Equations

We present a scalable and efficient iterative solver for high-order hybridized discontinuous Galerkin (HDG) discretizations of hyperbolic partial differential equations. It is an interplay between domain decomposition methods and HDG discretizations. In particular, the method is a fixed-point approach that requires only independent element-by-element local solves in each iteration. As such, it ...

متن کامل

From Godunov to a unified hybridized discontinuous Galerkin framework for partial differential equations

By revisiting the basic Godunov approach for linear system of hyperbolic Partial Differential Equations (PDEs) we show that it is hybridizable. As such, it is a natural recipe for us to constructively and systematically establish a unified HDG framework for a large class of PDEs including those of Friedrichs’ type. The unification is fourfold. First, it provides a single constructive procedure ...

متن کامل

Computational technique of linear partial differential equations by reduced differential transform ‎method

This paper presents a class of theoretical and iterative method for linear partial differential equations. An algorithm and analytical solution with a initial condition is obtained using the reduced differential transform method. In this technique, the solution is calculated in the form of a series with easily computable components. There test modeling problems from mathematical mechanic, physi...

متن کامل

Hybridized Discontinuous Galerkin Methods for Linearized Shallow Water Equations

We present a systematic and constructive methodology to devise various hybridized discontinuous Galerkin (HDG) methods for linearized shallow water equations. At the heart of our development is an upwind HDG framework obtained by hybridizing the upwind flux in the standard discontinuous Galerkin (DG) approach. The chief idea is to first break the uniqueness of the upwind flux across element bou...

متن کامل

Exploiting Batch Processing on Streaming Architectures to Solve 2D Elliptic Finite Element Problems: A Hybridized Discontinuous Galerkin (HDG) Case Study

Numerical methods for elliptic partial differential equations (PDEs) within both continuous (CG) and hybridized discontinuous Galerkin (HDG) frameworks share the same general structure: local (elemental) matrix generation followed by a global linear system assembly and solve. The lack of inter-element communication and easily parallelizable nature of the local matrix generation stage coupled wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2017